package August;

import com.sun.org.apache.xml.internal.security.utils.HelperNodeList;

import java.util.Scanner;

public class Day0812 {
    //最难的问题
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()){
            String str =scanner.nextLine();
            StringBuilder stringBuilder = new StringBuilder();

            char[] chars = str.toCharArray();
            for (int i = 0; i < chars.length; i++) {
                char c =chars[i];

                if (c != ' '){
                    if (c > 'E'){
                        c = (char) ((int)c - 5);
                    }else {
                        c = (char) ((int) c - 65 +86);
                    }
                }
                stringBuilder.append(c);
            }
            System.out.println(stringBuilder.toString());
        }
    }


    /**
     * 因子个数
     * @param args
     */
    public static void main2(String[] args) {
        Scanner s = new Scanner(System.in);
        while (s.hasNext()){
            int n = s.nextInt();

            if (isP(n)){
                System.out.println(1);
                continue;
            }
            int count = 0;
            for (int i = 2; i <= Math.sqrt(n) ; i++) {
                if (n%i == 0){
                    while (n%i == 0){
                        n /= i;
                    }
                    count++;
                }
            }
            if (n!=1)
                count++;
            System.out.println(count);
        }
    }

    private static boolean isP(int n) {
        for (int i = 2; i <= Math.pow(n,0.5) ; i++) {
            if (n%i == 0)
                return false;
        }
        return true;
    }



}
